Extraproximal Method for Markov Chains Finite Games

نویسنده

  • S. Moya
چکیده

In this paper a regularized version of the”extraproximal method” is suggested to be applied for finding a Nash equilibrium in a multi­participant finite game where the dynamics of each player is governed by a finite controllable Markov chain. The suggested iterative technique realizes the application of a two­step procedure at each iteration: at the first (or preliminary) step some ”predictive approximation” of the a current approximation is calculated; at the second step (the main step of the iteration) this prediction is used to complete the current iteration. The convergence of the suggested procedure to one of Nash­equilibrium is analyzed. The conditions guaranteeing this convergence are discussed. The numerical example demonstrates a good workability of the proposed approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Stackelberg/Nash Equilibria Using the Extraproximal Method: Convergence Analysis and Implementation Details for Markov Chains Games

In this paper we present the extraproximal method for computing the Stackelberg/Nash equilibria in a class of ergodic controlled finite Markov chains games. We exemplify the original game formulation in terms of coupled nonlinear programming problems implementing the Lagrange principle. In addition, Tikhonov’s regularization method is employed to ensure the convergence of the cost-functions to ...

متن کامل

Solving Stackelberg Security Games For Multiple Defenders and Multiple Attackers

In the last years, there has been a substantial effort in the application of Stackelberg game-theoretic approaches in the security arena, in which security agencies implement patrols and checkpoints to protect targets from criminal attacks. The classical game-theoretic approach employed successful to solve security games is that of a Stackelberg game between a defender (leader) and an attacker ...

متن کامل

Urban Traffic Control Problem: a Game

Abstract: Traffic congestion is an issue in every major city. Many approaches have been tried. In this paper, we propose to model signalized intersections as finite controlled Markov chains. The intersection represents a noncooperative game where each player try to minimize its queue, so ǫ−Nash’s equilibrium is the solution. This paper is focused on the traffic light control problem for urban t...

متن کامل

Empirical Bayes Estimation in Nonstationary Markov chains

Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical  Bayes estimators  for the transition probability  matrix of a finite nonstationary  Markov chain. The data are assumed to be of  a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...

متن کامل

Statistical equilibrium in simple exchange games I Methods of solution and application to the Bennati-Dragulescu-Yakovenko (BDY) game

Simple stochastic exchange games are based on random allocation of finite resources. These games are Markov chains that can be studied either analytically or by Monte Carlo simulations. In particular, the equilibrium distribution can be derived either by direct diagonalization of the transition matrix, or using the detailed balance equation, or by Monte Carlo estimates. In this paper, these met...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008